Graph rigidity reveals well-constrained regions of chromosome conformation embeddings
نویسندگان
چکیده
منابع مشابه
Graph rigidity reveals non-deformable collections of chromosome conformation constraints
Motivation: The physical structure of chromatin is associated with a variety of biological phenomena including long-range regulation, chromosome rearrangements, and somatic copy number alterations. Chromosome conformation capture is a recent experimental technique that results in pairwise proximity measurements between chromosome locations in a genome. This information can be used to construct ...
متن کاملAffine Isometric Embeddings and Rigidity
The Pick cubic form is a fundamental invariant in the (equi)affine differential geometry of hypersurfaces. We study its role in the affine isometric embedding problem, using exterior differential systems (EDS). We give pointwise conditions on the Pick form under which an isometric embedding of a Riemannian manifold M3 into R4 is rigid. The role of the Pick form in the characteristic variety of ...
متن کاملRigidity-Theoretic Constructions of Integral Fary Embeddings
Fáry [3] proved that all planar graphs can be drawn in the plane using only straight line segments. Harborth et al. [7] ask whether or not there exists such a drawing where all edges have integer lengths, and Geelen et al. [4] proved that cubic planar graphs satisfied this conjecture. We re-prove their result using rigidity theory, exhibit other natural families of planar graphs that satisfy th...
متن کاملCrossing Minimization within Graph Embeddings Crossing Minimization within Graph Embeddings
We propose a novel optimization-based approach to embedding heterogeneous high-dimensional data characterized by a graph. The goal is to create a two-dimensional visualization of the graph structure such that edge-crossings are minimized while preserving proximity relations between nodes. This paper provides a fundamentally new approach for addressing the crossing minimization criteria that exp...
متن کاملDegree constrained book embeddings
A book embedding of a graph consists of a linear ordering of the vertices along a line in 3-space (the spine), and an assignment of edges to half-planes with the spine as boundary (the pages), so that edges assigned to the same page can be drawn on that page without crossings. Given a graph G= (V ,E), let f :V → N be a function such that 1 f (v) deg(v). We present a Las Vegas algorithm which pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2012
ISSN: 1471-2105
DOI: 10.1186/1471-2105-13-241